  #    1
  #   1 1
  #  1 2 1
  # 1 3 3 1
# 打印n行杨辉三角
# def yanghui(n):
#     pass


def yanghui(n):
    data = [[1], [1,1]]

    for i in range(2,n):








# def processStr(s, k):
#     result = []
#     for i in s:
#         if i.islower():
#             result += i
#         elif i == '*':
#             if len(result) > 0:
#                 result = result[:len(result)-1]
#         elif i == '#':
#             result *= 2
#         elif i == '%':
#             result.reverse()
#     if k>len(result)-1:
#         return '.'
#     else:
#         return result[k]
#
# # 内存超限
# s = "%#bz%xum##i##vzo#pwc*#dkwbh####%uf%s*%cgppqhqa%h#l##o%ij%%cz%iga##e###u%#e####jfwx##%%*x%m*%#"
# k = 6523
# print(processStr(s,k))
